Contingency Analysis Based on Partitioned and Parallel Holomorphic Embedding

On Cluster Analysis Based on Contingency Tables

In _ Zytkow and Zembowicz (1993), a system for cluster analysis, based on two-way contingency tables, has been proposed. In its original form, the system is con ned to categorical and discrete multivariate data. The aim is to build a classi cation tree when, at each level of the tree, only binary splits are allowed. Within a one-level taxonomy formation, a systematic search is performed for pai...

Advancements on SEFE and Partitioned Book Embedding problems

In this work we investigate the complexity of some problems related to the Simultaneous Embedding with Fixed Edges (SEFE) of k planar graphs and the PARTITIONED k-PAGE BOOK EMBEDDING (PBE-k) problems, which are known to be equivalent under certain conditions. While the computational complexity of SEFE for k = 2 is still a central open question in Graph Drawing, the problem is NP-complete for k ...

Partitioned Parallel Radix Sort

Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in each round of radix, each processor has exactly the same number of keys, thereby reducing the overall sorting time. Load balanced radix sort is currently known as the fastest internal sorting method for distributed-memory multiprocessors. However, as the computation ...

Parallel Generation of Partitioned

In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a \good" way. When solving a partial dierential equation on a parallel distributed memory machine, the mesh should be decomposed so that the communication requirement of the numerical solver is minimised and also the amount of work to be performed on each processor is approximately equal....

On Holomorphic Embedding of Planar Domains into C2